The symmetric eigenvalue complementarity problem

In this paper the Eigenvalue Complementarity Problem (EiCP) with real symmetric matrices is addressed. It is shown that the symmetric (EiCP) is equivalent to finding an equilibrium solution of a differentiable optimization problem in a compact set. A necessary and sufficient condition for solvability is obtained which, when verified, gives a convenient starting point for any gradient-ascent local optimization method to converge to a solution of the (EiCP). It is further shown that similar results apply to the Symmetric Generalized Eigenvalue Complementarity Problem (GEiCP). Computational tests show that these reformulations improve the speed and robustness of the solution methods.